#include"BinaryTree_search.h"
int main()
{
	BSTree<int> ret;
	int a[] = {8,3,1,10,6,4,7,14,13};
	for (auto x : a)
	{
		ret.insert(x);
	}
	ret.InOrder(ret.GetNode());
	cout << endl;
	for (auto x : a)
	{
		ret.erase(x);
		ret.InOrder(ret.GetNode());
		cout << endl;
	}
	return 0;
}